Affine Subspaces of Curvature Functions from Closed Planar Curves
نویسندگان
چکیده
منابع مشابه
Curvature-based blending of closed planar curves
A common way of blending between two planar curves is to linearly interpolate their signed curvature functions and to reconstruct the intermediate curve from the interpolated curvature values. But if both input curves are closed, this strategy can lead to open intermediate curves. We present a new algorithm for solving this problem, which finds the closed curve whose curvature is closest to the...
متن کاملRecognizing Planar Curves Using Curvature-Tuned Smoothing
uses curvature information and tracks the derivative of curvature across scales to produce a syntactic description of curves. The In this paper the authors present a new technique for both the fact that explicit parts are extracted by both these approaches smoothing and decomposition of planar curves. This technique, is a very useful and appealing characteristic. Contour informadubbed “curvatur...
متن کاملOn Sampling Closed Planar Curves and Surfaces
In this paper we consider a problem of sampling a continuous planar curve. We show that in order to sample a curve, one needs to impose a priori assumptions about the type of parameterization (coordinate system), which would provide a functional form for otherwise just a set of points on the plane. The emphasis in this paper is on curves representable in polar coordinates, but the sampling tech...
متن کاملAffine invariant detection of perceptually parallel 3D planar curves
The problem of parallelism detection between two curves has been formulated in this paper as a line detection problem within an azne-invariant local similarity matrix computed for the two curves. Each element of this matrix gives an a$ne invariant measure of local parallelism for any pair of curve segments along the two curves. This approach enables the detection of a pair of parallel 3D planar...
متن کاملAffine and Projective Normalization of Planar Curves and Regions
Recent research has showed that invariant indexing can speed up the recognition process in computer vision. Extraction of invariant features can be done by choosing rst a canonical reference frame, and then features in this reference frame. These automatically become invariants. In this paper methods are given where a global and stable approach is used both in choosing the canonical reference f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Results in Mathematics
سال: 2021
ISSN: 1422-6383,1420-9012
DOI: 10.1007/s00025-021-01378-6